A Simple NOVCA: Near Optimal Vertex Cover Algorithm
نویسندگان
چکیده
منابع مشابه
A Fast Near Optimal Vertex Cover Algorithm (NOVCA)
This paper describes an extremely fast polynomial time algorithm, the Near Optimal Vertex Cover Algorithm (NOVCA) that produces an optimal or near optimal vertex cover for any known undirected graph G (V, E). NOVCA is based on the idea of (i) including the vertex having maximum degree in the vertex cover and (ii) rendering the degree of a vertex to zero by including all its adjacent vertices. T...
متن کاملA Heuristic Approach to Fast NOVCA (Near Optimal Vertex Cover Algorithm)
This paper describes an extremely fast polynomial time algorithm, the NOVCA (Near Optimal Vertex Cover Algorithm) that produces an optimal or near optimal vertex cover for any known undirected graph G (V, E). NOVCA is based on the idea of (1) including the vertex having maximum degree in the vertex cover and (2) rendering the degree of a vertex to zero by including all its adjacent vertices. Th...
متن کاملA Near Optimal Approximation Algorithm for Vertex-Cover Problem
Recently, there has been increasing interest and progress in improvising the approximation algorithm for well-known NP-Complete problems, particularly the approximation algorithm for the Vertex-Cover problem. Here we have proposed a polynomial time efficient algorithm for vertex-cover problem for more approximate to the optimal solution, which lead to the worst time complexity Θ(V ) and space c...
متن کاملA near-optimal sublinear-time algorithm for approximating the minimum vertex cover size
We give a nearly optimal sublinear-time algorithm for approximating the size of a minimum vertex cover in a graph G. The algorithm may query the degree deg(v) of any vertex v of its choice, and for each 1 ≤ i ≤ deg(v), it may ask for the ith neighbor of v. Letting VCopt(G) denote the minimum size of vertex cover in G, the algorithm outputs, with high constant success probability, an estimate V̂C...
متن کاملA near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size Citation
We give a nearly optimal sublinear-time algorithm for approximating the size of a minimum vertex cover in a graph G. The algorithm may query the degree deg(v) of any vertex v of its choice, and for each 1 ≤ i ≤ deg(v), it may ask for the i neighbor of v. Letting VCopt(G) denote the minimum size of vertex cover in G, the algorithm outputs, with high constant success probability, an estimate V̂C(G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2012
ISSN: 1877-0509
DOI: 10.1016/j.procs.2012.04.080